#include "PriorityQueue.h"
#include "reverse_iterator.h"
#include "list.h"
using namespace std;

int main()
{
	/*liu::priority_queue<int> pq;
	pq.push(1);
	pq.push(5);
	pq.push(3);
	pq.push(1);
	pq.push(2);
	pq.push(0);

	while (!pq.empty())
	{
		cout << pq.top() << " ";
		pq.pop();
	}
	cout << endl;

	int arr[10] = { 3,1,2,5,4,6,8,7,9,10 };
	liu::priority_queue<int> heap(arr,arr+sizeof(arr)/sizeof(arr[0]));
	while (!heap.empty())
	{
		cout << heap.top() << " ";
		heap.pop();
	}*/

	liu::test_list2();
	



	return 0;
}